Pii: S0191-2615(98)00016-2
نویسندگان
چکیده
ÐThe dynamic and stochastic shortest path problem (DSSPP) is de®ned as ®nding the expected shortest path in a trac network where the link travel times are modeled as a continuous-time stochastic process. The objective of this paper is to examine the properties of the problem and to identify a technique that can be used to solve the DSSPP given information that will be available in networks with Intelligent Transportation System (ITS) capabilities. The paper ®rst identi®es a set of relationships between the mean and variance of the travel time of a given path and the mean and variance of the dynamic and stochastic link travel times on these networks. Based on these relationships it is shown that the DSSPP is computationally intractable and traditional shortest path algorithms cannot guarantee an optimal solution. A heuristic algorithm based on the k-shortest path algorithm is subsequently proposed to solve the problem. Lastly, the trade-o between solution quality and computational eciency of the proposed algorithm is demonstrated on a realistic network from Edmonton, Alberta. # 1998 Elsevier Science Ltd. All rights reserved
منابع مشابه
Pii: S0191-2615(98)00028-9
The Multinomial Probit (MNP) formulation provides a very general framework to allow for interdependent alternatives in discrete choice analysis. Up until recently, its use was rather limited, mainly because of the computational diculties associated with the evaluation of the choice probabilities which are multidimensional normal integrals. In recent years, the econometric estimation of Multino...
متن کاملPii: S0191-2615(99)00021-1
We consider nonlinear nonconvex capacitated transportation problems where the nonlinearity occurs only in the last row of the transportation tableau. This transportation model can be successfully applied to economics representing the nonlinearity caused by penalties for unsatis®ed contractual quantities or by changing in price. An algorithm for local optimization, based on the algorithms for so...
متن کاملPii: S0191-2615(99)00057-0
This paper addresses the problem of determining a dynamic berth assignment to ships in the public berth system. While the public berth system may not be suitable for most container ports in major countries, it is desired for higher cost-eectiveness in Japan's ports. The berth allocation to calling ships is a key factor for ecient public berthing. However, it is not calculated in polynomially-...
متن کاملPii: S0191-2615(99)00011-9
A reduction method is proposed which allows standard sensitivity techniques for variational inequalities to applied to equilibrium network ̄ow problems without additional assumptions on either the underlying network or the numbers of active paths. In particular it is shown that under mild regularity conditions, small perturbations of equilibria can be given an explicit arc̄ow representation whic...
متن کاملPii: S0191-2615(99)00020-x
This paper presents improved time-dependent control strategies for small freeway networks with bottlenecks and unique origin±destination paths. It is assumed that there are no spill-overs from any of the freeway exits so that freeway queues and delays can be completely avoided by regulating access to the system so as to maintain bottleneck ̄ows strictly below capacity. It is also assumed that t...
متن کامل